Nonstandard Generic Points

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The generic filter property in nonstandard analysis

In this paper two new combinatorial principles in nonstandard analysis are isolated and applications are given. The second principle provides an equivalent formulation of Henson’s isomorphism property.

متن کامل

Integral Points on Generic Fibers

Let P (x, y) be a rational polynomial. If the curve (P (x, y) = k), k ∈ Q, is irreducible and admits an infinite number of points whose coordinates are integers, Siegel’s theorem implies that the curve is rational. We deal with the case where k is a generic value and prove, in the spirit of the Abhyankar-MohSuzuki theorem, that there exists an algebraic automorphism sending P (x, y) to the poly...

متن کامل

Regions in the nonstandard plane that contain no standard points

Nonstandard methods are applied to continuum theory in the plane. The main result concerns internal regions V that contain no standard points and have the property that st(V) does not disconnect the plane and are bounded by simple closed curves that have small intersection with ∗st(V). We show that such sets cannot contain a “Y-set” consisting of three arcs intersecting only at a single common ...

متن کامل

Generic initial ideals of points and curves

Let I be the defining ideal of a smooth irreducible complete intersection space curve C with defining equations of degrees a and b. We use the partial elimination ideals introduced by Mark Green to show that the lexicographic generic initial ideal of I has Castelnuovo-Mumford regularity 1+ ab(a− 1)(b− 1)/2 with the exception of the case a = b = 2, where the regularity is 4. Note that ab(a− 1)(b...

متن کامل

A Generic Approach for Escaping Saddle points

A central challenge to using first-order methods for optimizing nonconvex problems is the presence of saddle points. First-order methods often get stuck at saddle points, greatly deteriorating their performance. Typically, to escape from saddles one has to use second-order methods. However, most works on second-order methods rely extensively on expensive Hessian-based computations, making them ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Belgian Mathematical Society - Simon Stevin

سال: 2007

ISSN: 1370-1444

DOI: 10.36045/bbms/1170347824